The Bedsheet: From Linen Cupboard to Art Gallery
نویسندگان
چکیده
منابع مشابه
the aesthetic dimension of howard barkers art: a frankfurtian approach to scenes from an execution and no end of blame
رابطه ی میانِ هنر و شرایطِ اجتماعیِ زایش آن همواره در طولِ تاریخ دغدغه ی ذهنی و دل مشغولیِ اساسیِ منتقدان و نیز هنرمندان بوده است. از آنجا که هنر در قفس آهنیِ زندگیِ اجتماعی محبوس است، گسترش وابستگیِ آن با نهاد ها و اصولِ اجتماعی پیرامون، صرفِ نظر از هم سو بودن و یا غیرِ هم سو بودنِ آن نهاد ها، امری اجتناب ناپذیر به نظر می رسد. با این وجود پدیدار گشتنِ چنین مباحثِ حائز اهمییتی در میان منتقدین، با ظهورِ مکتب ما...
Art Gallery Localization
We study the problem of placing a set T of broadcast towers in a simple polygon P in order for any point to locate itself in the interior of P . Let V (p) denote the visibility polygon of a point p, as the set of all points q ∈ P that are visible to p. For any point p ∈ P : for each tower t ∈ T ∩ V (p) the point p receives the coordinates of t and the Euclidean distance between t and p. From th...
متن کاملVirtual Art Gallery Tool
This paper describes a set of two applications comprising the Virtual Art Gallery tool: the Space Picker application and the Virtual Exhibition Builder application. The purpose of this tool is to allow users to interactively create a virtual exhibition of artworks in a pre-built virtual model. We use X3D for the models and Java with Xj3D for the display and handling. The works of art are handle...
متن کاملAn Art Gallery approach to submap meshing
The Art Gallery Theorem and its lemmas have been used since the 1990s in the area of computer graphics to decompose orthogonal polygons into convex sub-regions. This paper extends and improvises Art Gallery concepts to non-orthogonal, generic polygons to perform a multiblock decomposition of faces into a set of maximal, single-loop, convex sub-faces. Concepts such as staircase, dent and notch a...
متن کاملAlgorithms for art gallery illumination
The Art Gallery Problem (AGP) is one of the classical problems in computational geometry. It asks for the minimum number of guards required to achieve visibility coverage of a given polygon. The AGP is well-known to be NP-hard even in restricted cases. In this paper, we consider the Art Gallery Problem with Fading (AGPF): A polygonal region is to be illuminated with light sources such that ever...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TEXTILE
سال: 2018
ISSN: 1475-9756,1751-8350
DOI: 10.1080/14759756.2018.1432142